package com.wuad.platformwuad.module.study.collection;

import lombok.extern.slf4j.Slf4j;

/**
 * 冒泡排序算法
 *
 * @author ：Wuad
 * @date ：Created in 2021/3/1 17:57
 * @description :  冒泡排序算法
 */
@Slf4j
public class Maopao {

    public static void main(String[] args) {
        int[] arr = new int[]{-12,3,2,34,5,8,1};
        //冒泡排序
        for(int i = 0;i < arr.length-1;i++){
            for(int j = 0;j <arr.length-1-i;j++){
            if(arr[j] >arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        //遍历
        for (int i = 0; i < arr.length; i++) {
        System.out.println(arr[i]+"\t");
        }
    }

}

